#include <bits/stdc++.h>
using namespace std;
#define r(i,a,n) for (int i=a;i<n;i++)
int n,m,k,x,y,a,b,d[2010][2010],v[2010][2010];
bool solve(int x,int y,int k) {
int l=max(1,x-k),r=min(x+k,n),t;
r(i,l,r+1) {
t=k-abs(i-x);
if (y-t>0&&!v[i][y-t]) return a=i,b=y-t,1;
if (y+t<=m&&!v[i][y+t]) return a=i,b=y+t,1;
}
return 0;
}
int main() {
scanf("%d%d%d",&n,&m,&k);
r(t,0,k) {
scanf("%d%d",&x,&y);
r(i,-2,3) r(j,-2,3) {
if (x+i<1||x+i>n||y+j<1||y+j>m) continue;
d[x][y]=max(d[x][y],d[x+i][y+j]-abs(i)-abs(j));
}
while (!solve(x,y,d[x][y]))d[x][y]++;
printf("%d %d\n",a,b);
v[a][b]=1;
}
}/*1697935941.580456*/
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |